package org.lql.algo.codecrush.hot100.binarySearch;

/**
 * @author: liangqinglong
 * @date: 2025-08-31 23:36
 * @description: 4. 寻找两个正序数组的中位数 <a href="https://leetcode.cn/problems/median-of-two-sorted-arrays/description/?envType=study-plan-v2&envId=top-100-liked">...</a>
 **/
public class FindMedianSortedArrays {

	public double findMedianSortedArrays(int[] nums1, int[] nums2) {

		return 1L;
	}
}
